A parallel algorithm for bisection width in trees

A bisection algorithm for grammar-based compression of ordered trees

A Proof for Bisection Width of Grids

The optimal bisection width of r-dimensional N× · · · ×N grid is known to be N when N is even, but when N is odd, only approximate values are available. This paper shows that the exact bisection width of grid is N r −1

A parallel radial bisection algorithm for inverse scattering problems

Alliances and Bisection Width for Planar Graphs

An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polynomial time. We base this on a proof of an upper bound of n on the bisection width for 4-connected pl...

Mixed Domination in Trees: A Parallel Algorithm

A set of vertices S in a graph G = (V;E) is called a dominating set of G if every vertex in the set (V n S) is adjacent to some vertex in S. For arbitrary graphs, the problem of computing smallest dominating set is NP-complete [3]. A slightly more general version of this problem is called \mixed domination" problem [1]. In this paper we present new parallel NC algorithm to nd smallest mixed dom...